Verifying Explicit Substitution Calculi in Binding Structures with Effect-Binding
نویسنده
چکیده
Binding structures enrich traditional abstract syntax by providing support for representing binding mechanisms (based on deBruijn indices), term-schemata and a very clean algebraic theory of substitution. We provide a novel binding structure with the following main results: 1) The formalisation of a generic binding structure with the novel concept of effect-binding that enables the explicit representations of both contexts and terms inside one term meta-language, 2) The foundation of a formal (machine-assisted) substitution theory of effect-binding that is well-suited for mechanisation. This can be used for the systematic and correct development of new calculi with explicit substitutions. The substitution theory is formally proven in Isabelle/HOL; the implementation may serve as (untyped) framework for deep embeddings.
منابع مشابه
The Effect of Substitution of a Zn Atom in Cdn-1TenClusters (n=1-10)
In this research, structural and electronic properties of ZnCdn-1Ten clusters (n=1-10) have been studied by formalism of density functional theory and using the projector augmented wave within local density approximation. The structural properties (such as bond length/angle and coordination number), electronic and optical properties (such as binding energy, Kohn-Sham spect...
متن کاملCut Rules and Explicit Substitutions RENÉ
We introduce a method to associate calculi of proof terms and rewrite rules with cut elimination procedures for logical deduction systems (i.e., Gentzen-style sequent calculi) in the case of intuitionistic logic. We illustrate this method using two different versions of the cut rule for a variant of the intuitionistic fragment of Kleene's logical deduction system G3. Our systems are in fact cal...
متن کاملThe Suspension Calculus and its Relationship to Other Explicit Treatments of Substitution in Lambda Calculi
The intrinsic treatment of binding in the lambda calculus makes it an ideal data structure for representing syntactic objects with binding such as formulas, proofs, types, and programs. Supporting such a data structure in an implementation is made difficult by the complexity of the substitution operation relative to lambda terms. To remedy this, researchers have suggested representing the meta ...
متن کاملThe Suspension Calculus and its
The intrinsic treatment of binding in the lambda calculus makes it an ideal data structure for representing syntactic objects with binding such as formulas, proofs, types, and programs. Supporting such a data structure in an implementation is made difficult by the complexity of the substitution operation relative to lambda terms. To remedy this, researchers have suggested representing the meta ...
متن کاملEffect of Curvature on the Mechanical Properties of Graphene: A Density Functional Tight-binding Approach
Due to the high cost of experimental analyses, researchers used atomistic modeling methods for predicting the mechanical behavior of the materials in the fields of nanotechnology. In the pre-sent study the Self-Consistent Charge Density Functional Tight-Binding (SCC-DFTB) was used to calculate Young's moduli and average potential energy of the straight and curved graphenes with different curvat...
متن کامل